Factorization with genus 2 curves
نویسنده
چکیده
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to reduce the complexity of the algorithm. Our implementation GMP-HECM is faster than GMP-ECM for factoring big numbers.
منابع مشابه
Decomposing Jacobians of Hyperelliptic Curves
Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...
متن کاملFast genus 2 arithmetic based on Theta functions
In 1986, D. V. Chudnovsky and G. V. Chudnovsky proposed to use formulae coming from Theta functions for the arithmetic in Jacobians of genus 2 curves. We follow this idea and derive fast formulae for the scalar multiplication in the Kummer surface associated to a genus 2 curve, using a Montgomery ladder. Our formulae can be used to design very efficient genus 2 cryptosystems that should be fast...
متن کاملFast Endomorphism for any Genus 2 Hyperelliptic Curve over a Finite Field of Even Characteristic
In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic cu...
متن کاملConics - a Poor Man’s Elliptic Curves
Introduction 2 1. The Group Law on Pell Conics and Elliptic Curves 2 1.1. Group Law on Conics 2 1.2. Group Law on Elliptic curves 3 2. The Group Structure 3 2.1. Finite Fields 3 2.2. p-adic Numbers 3 2.3. Integral and Rational Points 4 3. Applications 4 3.1. Primality Tests 4 3.2. Factorization Methods 5 4. 2-Descent 5 4.1. Selmer and Tate-Shafarevich Group 5 4.2. Heights 6 5. Analytic Methods ...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009